Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations
نویسندگان
چکیده
منابع مشابه
Distributed Stochastic Search Algorithm for Multi-ship Encounter Situations
Ship collision avoidance involves helping ships find routes that will best enable them to avoid a collision.When more than two ships encounter each other, the procedure becomes more complex since a slight change in course by one ship might affect the future decisions of the other ships. Two distributed algorithms have been developed in response to this problem: Distributed Local Search Algorith...
متن کاملDistributed Stochastic Search Algorithm for n-Ship Collision Avoidance
In this paper, to prevent collisions between ships, we introduce the Distributed Stochastic Search Algorithm (DSSA), which allows each ship to change her next-intended course in a stochastic manner immediately after receiving all of the intentions from the neighboring ships. We also suggest a new cost function that considers both safety and efficiency. We empirically show that DSSA requires muc...
متن کاملStochastic Search In Changing Situations
Stochastic search algorithms are black-box optimizer of an objective function. They have recently gained a lot of attention in operations research, machine learning and policy search of robot motor skills due to their ease of use and their generality. However, when the task or objective function slightly changes, many stochastic search algorithms require complete re-learning in order to adapt t...
متن کاملShip Collision Avoidance by Distributed Tabu Search
More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship colli...
متن کاملUsing a new modified harmony search algorithm to solve multi-objective reactive power dispatch in deterministic and stochastic models
The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Navigation
سال: 2017
ISSN: 0373-4633,1469-7785
DOI: 10.1017/s037346331700008x